Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings

We consider the following oblivious sketching problem: given ∈ (0, 1/3) and n ≥ d/ 2, design a distribution D over Rk×nd and a function f : R × R → R, so that for any n× d matrix A, Pr S∼D [(1− )‖A‖op ≤ f(S(A), S) ≤ (1 + )‖A‖op] ≥ 2/3, where ‖A‖op = supx:‖x‖2=1 ‖Ax‖2 is the operator norm of A and S(A) denotes S ·A, interpreting A as a vector in R. We show a tight lower bound of k = Ω(d2/ 2) for this problem. Previously, Nelson and Nguyen (ICALP, 2014) considered the problem of finding a distribution D over Rk×n such that for any n× d matrix A, Pr S∼D [∀x, (1− )‖Ax‖2 ≤ ‖SAx‖2 ≤ (1 + )‖Ax‖2] ≥ 2/3, which is called an oblivious subspace embedding (OSE). Our result considerably strengthens theirs, as it (1) applies only to estimating the operator norm, which can be estimated given any OSE, and (2) applies to distributions over general linear operators S which treat A as a vector and compute S(A), rather than the restricted class of linear operators corresponding to matrix multiplication. Our technique also implies the first tight bounds for approximating the Schatten p-norm for even integers p via general linear sketches, improving the previous lower bound from k = Ω(n2−6/p) [Regev, 2014] to k = Ω(n2−4/p). Importantly, for sketching the operator norm up to a factor of α, where α − 1 = Ω(1), we obtain a tight k = Ω(n2/α4) bound, matching the upper bound of Andoni and Nguyen (SODA, 2013), and improving the previous k = Ω(n2/α6) lower bound. Finally, we also obtain the first lower bounds for approximating Ky Fan norms. 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity